منابع مشابه
Hidden convexity in partially separable optimization
The paper identifies classes of nonconvex optimization problems whose convex relaxations have optimal solutions which at the same time are global optimal solutions of the original nonconvex problems. Such a hidden convexity property was so far limited to quadratically constrained quadratic problems with one or two constraints. We extend it here to problems with some partial separable structure....
متن کاملElement-by-Element Preconditioners for Large Partially Separable Optimization Problems
We study the solution of large-scale nonlinear optimization problems by methods which aim to exploit their inherent structure. In particular, we consider the property of partial separability, first studied by Griewank and Toint [Nonlinear Optimization, 1981, pp. 301–312]. A typical minimization method for nonlinear optimization problems approximately solves a sequence of simplified linearized s...
متن کاملImproving the Decomposition of Partially Separable Functions in the Context of Large-scale Optimization: a Rst Approach
This paper examines the question of modifying the decomposition of a partially separable function in order to improve computational eciency of large-scale minimization algorithms using a conjugate-gradient inner iteration. The context and motivation are given and the application of a simple strategy discussed on examples extracted from the CUTE test problem collection.
متن کاملComplete decomposition algorithm for nonconvex separable optimization problems and applications
Abstraet~In this paper, we present a complete decomposition algorithm for nonconvex separable optimization problems applied in the optimal control problems. This complete decomposition algorithm combines recursive quadratic programming with the dual method. When our algorithm is applied to discretized optimal control problems, a simple and parallel computation and a simple and regular data flow...
متن کاملAn interior-point Lagrangian decomposition method for separable convex optimization
In this paper we propose a distributed algorithm for solving large-scale separable convex problems using Lagrangian dual decomposition and the interior-point framework. By adding self-concordant barrier terms to the ordinary Lagrangian we prove under mild assumptions that the corresponding family of augmented dual functions is self-concordant. This makes it possible to efficiently use the Newto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2014
ISSN: 1052-6234,1095-7189
DOI: 10.1137/130926924